Model reductions with special CSP data
نویسنده
چکیده
The model reduction methodology of computational singular perturbation (CSP) is enhanced for chemical kinetics problems. The leading order converged CSP-refined fast basis vectors are obtained analytically by exploiting the special format of the given reaction-specific chemical kinetics data. The leading order net reaction rates of the fast reactions (after they are exhausted) are also obtained analytically. Taking advantage of these leading order analytical results, a new model reduction strategy is advocated. The implementation of this new strategy is very straightforward, and extraction of general insights on the reaction system is also easier.
منابع مشابه
On Holant Problems
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant Problems. Compared to counting Constrained Satisfaction Problems (#CSP), it is a refinement with a more explicit role for the function constraints. Both graph homomorphism and #CSP can be viewed as special cases of Holant Problems. We prove complexity dichotomy theorems in this frame...
متن کاملFormal Method in Service Composition in Heath Care Systems
One of the areas with greatest needs having available information at the right moment and with high accuracy is healthcare. Right information at right time saves lives. Healthcare is a vital domain which needs high processing power for high amounts of data. Due to the critical and the special characteristics of these systems, formal methods are used for specification, description and verificati...
متن کاملComputational Complexity of Holant Problems
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant problems. Compared to counting constraint satisfaction problems (#CSP), it is a refinement with a more explicit role for the constraint functions. Both graph homomorphism and #CSP can be viewed as special cases of Holant problems. We prove complexity dichotomy theorems in this framew...
متن کاملThe Structured Weighted Violations Perceptron Algorithm
We present the Structured Weighted Violations Perceptron (SWVP) algorithm, a new structured prediction algorithm that generalizes the Collins Structured Perceptron (CSP, (Collins, 2002)). Unlike CSP, the update rule of SWVP explicitly exploits the internal structure of the predicted labels. We prove the convergence of SWVP for linearly separable training sets, provide mistake and generalization...
متن کاملA constraint-satisfaction approach for 3D vision/touch-based object recognition
We present a technique for recognizing polyhedral objects by integrating visual and tactile data. The problem is formulated as a constraint-satisfaction problem (CSP) to provide a uniied framework for integrating diierent types of sensory data. To make use of the scene perceptual structures early in the recognition process , we enforce local consistency of the CSP. The process of local-consiste...
متن کامل